Towards optimal parallel bucket sorting
نویسندگان
چکیده
منابع مشابه
Parallel Bucket Sorting Algorithm
Bucket sorting algorithm achieves O(n) running time complexity in average. It is very fast compared to any comparison-based sorting algorithms that usually have a lower bound of Ω(n log n). Given an unsorted array of n positive integers, bucket sorting algorithm works by distributing the elements into m ordered buckets each contains zero or more elements. Each bucket is then sorted using either...
متن کاملAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کاملThe Takeoff Towards Optimal Sorting Networks
A complete set of filters Fn for the optimal-depth n-input sorting network problem is such that if there exists an n-input sorting network of depth d then there exists one of the form C ⊕ C′ for some C ∈ Fn. Previous work on the topic presents a method for finding complete set of filters Rn,1 and Rn,2 that consists only of networks of depths one and two respectively, whose outputs are minimal a...
متن کاملTowards Optimal Sorting of 16 Elements
One of the fundamental problem in the theory of sorting is to find the pessimistic number of comparisons sufficient to sort a given number of elements. Currently 16 is the lowest number of elements for which we do not know the exact value. We know that 46 comparisons suffices and that 44 do not. There is an open question if 45 comparisons are sufficient. We present an attempt to resolve that pr...
متن کامل: Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem
The data dependent prefix problem is to compute all the n initial products x1⃝x2⃝...⃝xk, 1 ≤ k ≤ n, where the order is specified by a linked list. A parallel algorithm for the data dependent prefix problem is presented. This algorithm has time complexity O( n p + log n log n p ) using p processors on the exclusive-read exclusive-write computation model. A bucket sorting algorithm is also develo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1987
ISSN: 0890-5401
DOI: 10.1016/0890-5401(87)90062-9